A partial consequence account of truthlikeness
نویسندگان
چکیده
منابع مشابه
A Partial Account of Presupposition Projection
In this paper it is shown how a partial semantics for presuppositions can be given which is empirically more satisfactory than its predecessors, and how this semantics can be integrated with a technically sound, compositional grammar in the Montagovian fashion. Additionally, it is argued that the classical objection to partial accounts of presupposition projection, namely that they lack ‘flexib...
متن کاملTruthlikeness, Rationality And Scientific Method
I. A. Kieseppä’s criticism of the methodological use of the theory of verisimilitude, and D. B. Resnik’s arguments against the explanation of scientific method by appeal to scientific aims are critically considered. Since the notion of verisimilitude was introduced as an attempt to show that science can be seen as a rational enterprise in the pursuit of truth, defenders of the verisimilitude pr...
متن کاملTh2 cell clonal anergy as a consequence of partial activation
We have demonstrated Th2 clonal anergy as a consequence of partial T cell activation by immunogenic peptide and chemically fixed APC, as well as by altered peptide ligand and live antigen-presenting cells (APC). Either stimulation resulted in a profound inability of the T cells to proliferate upon restimulation with antigen and functional APC, a similar phenomenon to that found with Th1 cells. ...
متن کاملA Note on Truthlikeness and Irrelevance
Parameterized verisimilar or truthlike orders are concerned with ordering theories relative to a third theory. We argue that not only should irrelevant consequences of the theories to be ordered be disallowed, but so should irrelevant consequences of the theory relative to which the order is defined.
متن کاملA Semantic Account of Type-Directed Partial Evaluation
We formally characterize partial evaluation of functional programs as a normalization problem in an equational theory, and derive a type-based normalization-by-evaluation algorithm for computing normal forms in this setting. We then establish the correctness of this algorithm using a semantic argument based on Kripke logical relations. For simplicity, the results are stated for a nonstrict, pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2018
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-018-01947-3